FOM accelerated by an extrapolation method for solving PageRank problems

An efficient approach for solving layout problems

This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...

An Extrapolation Method Based on Solving s Sequence of Collocation Problems

On adaptively accelerated Arnoldi method for computing PageRank

A generalized refined Arnoldi method based on the weighted inner product is presented for computing PageRank. The properties of the generalized refined Arnoldi method were studied. To speed up the convergence performance for computing PageRank, we propose to change the weights adaptively where the weights are calculated based on the current residual corresponding to the approximate PageRank vec...

Rational extrapolation for the PageRank vector

An important problem in web search is to determine the importance of each page. From the mathematical point of view, this problem consists in finding the nonnegative left eigenvector of a matrix corresponding to its dominant eigenvalue 1. Since this matrix is neither stochastic nor irreducible, the power method has convergence problems. So, the matrix is replaced by a convex combination, depend...

An Accelerated Iterative Method with Diagonally Scaled Oblique Projections for Solving Linear Feasibility Problems

The Projected Aggregation Methods (PAM) for solving linear systems of equalities and/or inequalities, generate a new iterate xk+1 by projecting the current point xk onto a separating hyperplane generated by a given linear combination of the original hyperplanes or halfspaces. In Scolnik et al. (2001, 2002a) and Echebest et al. (2004) acceleration schemes for solving systems of linear equations ...